regexp/syntax.parser.stack (field)

50 uses

	regexp/syntax (current package)
		parse.go#L128: 	stack       []*Regexp // stack of parsed expressions
		parse.go#L201: 		for _, re := range p.stack {
		parse.go#L263: 		for _, re := range p.stack {
		parse.go#L324: 	p.stack = append(p.stack, re)
		parse.go#L339: 	n := len(p.stack)
		parse.go#L344: 	re1 := p.stack[n-1]
		parse.go#L345: 	re2 := p.stack[n-2]
		parse.go#L361: 	p.stack = p.stack[:n-1]
		parse.go#L417: 	n := len(p.stack)
		parse.go#L421: 	sub := p.stack[n-1]
		parse.go#L432: 	p.stack[n-1] = re
		parse.go#L480: 	i := len(p.stack)
		parse.go#L481: 	for i > 0 && p.stack[i-1].Op < opPseudo {
		parse.go#L484: 	subs := p.stack[i:]
		parse.go#L485: 	p.stack = p.stack[:i]
		parse.go#L499: 	i := len(p.stack)
		parse.go#L500: 	for i > 0 && p.stack[i-1].Op < opPseudo {
		parse.go#L503: 	subs := p.stack[i:]
		parse.go#L504: 	p.stack = p.stack[:i]
		parse.go#L1087: 		p.stack = p.stack[:len(p.stack)-1]
		parse.go#L1091: 	n := len(p.stack)
		parse.go#L1095: 	return p.stack[0], nil
		parse.go#L1377: 	n := len(p.stack)
		parse.go#L1378: 	if n >= 3 && p.stack[n-2].Op == opVerticalBar && isCharClass(p.stack[n-1]) && isCharClass(p.stack[n-3]) {
		parse.go#L1379: 		re1 := p.stack[n-1]
		parse.go#L1380: 		re3 := p.stack[n-3]
		parse.go#L1384: 			p.stack[n-3] = re3
		parse.go#L1388: 		p.stack = p.stack[:n-1]
		parse.go#L1393: 		re1 := p.stack[n-1]
		parse.go#L1394: 		re2 := p.stack[n-2]
		parse.go#L1399: 				cleanAlt(p.stack[n-3])
		parse.go#L1401: 			p.stack[n-2] = re1
		parse.go#L1402: 			p.stack[n-1] = re2
		parse.go#L1414: 		p.stack = p.stack[:len(p.stack)-1]
		parse.go#L1418: 	n := len(p.stack)
		parse.go#L1422: 	re1 := p.stack[n-1]
		parse.go#L1423: 	re2 := p.stack[n-2]
		parse.go#L1424: 	p.stack = p.stack[:n-2]